metric algorithm

См. также в других словарях:

• Metric tree — This article is about the data structure. For the type of metric space, see Real tree. A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle… …   Wikipedia

• Metric k-center — In graph theory, the metric k center, is a combinatorial optimization problem studied in theoretical computer science. Given n cities with specified distances, one wants to build k warehouses in different cities and minimize the distance of the… …   Wikipedia

• Metric signature — The signature of a metric tensor (or more generally a nondegenerate symmetric bilinear form, thought of as quadratic form) is the number of positive and negative eigenvalues of the metric. That is, the corresponding real symmetric matrix is… …   Wikipedia

• Viterbi algorithm — The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ndash; called the Viterbi path ndash; that results in a sequence of observed events, especially in the context of Markov information… …   Wikipedia

• k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… …   Wikipedia

• Diffusing update algorithm — DUAL, the Diffusing Update ALgorithm, is the algorithm used by Cisco s EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a routing loop. According to Cisco, the full name of the algorithm is DUAL …   Wikipedia

• String metric — String metrics (also known as similarity metrics) are a class of textual based metrics resulting in a similarity or dissimilarity (distance) score between two pairs of text strings for approximate matching or comparison and in fuzzy string… …   Wikipedia

• Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… …   Wikipedia

• K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… …   Wikipedia

• Karp-Flatt metric — The Karp Flatt Metric is a measure of parallelization of code in parallel processor systems. This metric exists in addition to Amdahl s Law and the Gustafson s Law as an indication of the extent to which a particular computer code is parallelized …   Wikipedia

• Trust metric — In psychology and sociology, a trust metric is a measure of how a member of a group is trusted by the other members. Trust metrics may be abstracted in a manner that can be implemented on computers, making them of interest for the study and… …   Wikipedia